Sos Partial Ordering Semantics of -calculus
نویسندگان
چکیده
In this paper we present a partial ordering semantics for the-calculus. The model we adopt is transition system based. In spite of their inter-leaving nature, we show that it is possible to completely abstract from the generation ordering of transitions. The deenition of this semantics drive us in deening a standard SOS semantics that directly yields the partial ordering semantics of-calculus.
منابع مشابه
Interleaving based Partial Ordering Semantics
This paper present a partial ordering semantics for process calculi. The semantics is deened in SOS style and it is based on transition systems. We adopt proved transition system, whose transitions are labelled with encodings of their proofs and whose nodes are the same of the classical interleaving semantics. Relabelling functions are deened to retrive causal models that can take generation or...
متن کاملA Partial Ordering Semantics for CCS
A new operatilcrnql semantics for *‘pure” CCS is proposed that considers the parallel operator as a first class one, and permits a description of the calculus in terms of partial orderings. The new semantics (also for unguarded agents) is given in the SOS style via the partial ordering derivation relation. CCS agenis are decomposed into sets of sequential subagents. The new derivations relate s...
متن کاملFormats of Ordered SOS Rules with Silent Actions
We present a general and uniform method for deening structural operational semantics (SOS) of process algebra operators by traditional Plotkin-style rules equipped with an ordering, the new feature which states the order of application of rules when deriving transitions of process terms. Our method allows to represent negative premises and copying in the presence of silent actions. We identify ...
متن کاملNon-Interleaving Semantics for Mobile Processes
This paper studies causality in the-calculus. Our notion of causality combines the dependencies given by the syntactic structure of processes with those originated by passing names. Our studies show that two transitions not causally related may however occur in a xed ordering in any computation, i.e., the-calculus may implicitly express a precedence between actions. The same partial order of tr...
متن کاملContents A Simple Graph Grammar Enabling the Representation of Layered
concurrent semantics are also defined. Three classical observations for concurrent semantics — interleaving, partial ordering and mixed ordering — are defined on the graph derivations. Bisimulation is exploited to obtain three equivalences of π-calculus agents corresponding to the observations. As expected, the ordinary observational equivalence for the π-calculus is re-obtained in this context...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996